Real roots of univariate polynomials and straight line programs
نویسندگان
چکیده
منابع مشابه
Real roots of univariate polynomials and straight line programs
We give a new proof of the NP-hardness of deciding the existence of real roots of an integer univariate polynomial encoded by a straight line program based on certain properties of the Tchebychev polynomials. These techniques allow us to prove some new NP-hardness results related to real root approximation for polynomials given by straight line programs.
متن کاملInterpolation of polynomials given by straight-line programs
We give an algorithm for the interpolation of a polynomial A given by a straight-line program. Its complexity is polynomial in τ, log(d), L, n, where τ is an input bound on the number of terms in A, d is a bound on its partial degree in all variables, L is the length of the given straight-line program and n is the number of variables.
متن کاملFactorization of Polynomials Given by Straight-Line Programs
An algorithm is developed for the factorization of a multivariate polynomial represented by a straight-line program into its irreducible factors. The algorithm is in random polynomial-time as a function in the input size, total degree, and binary coefficient length for the usual coefficient fields and outputs a straight-line program, which with controllably high probability correctly determines...
متن کاملIndexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملBudan tables of real univariate polynomials
The Budan table of f collects the signs of the iterated derivatives of f . We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connectivity property of its Budan table. We use this property to characterize the virtual roots of f (introduced by Gonzalez-Vega, Lombardi, Mahé in 1998); they are continuous functions of the coefficients of f . We als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2007
ISSN: 1570-8667
DOI: 10.1016/j.jda.2006.10.002